Deadlock-Free Routing in InfiniBand through Destination Renaming
نویسندگان
چکیده
The InfiniBand Architecture (IBA) defines a switch-based network with point-to-point links that supports any topology defined by the user, including irregular ones, in order to provide flexibility and incremental expansion capability. Routing in IBA is distributed, based on forwarding tables, and only considers the packet destination ID for routing within subnets in order to drastically reduce forwarding table size. Unfortunately, the forwarding tables for most of the previously proposed routing algorithms for irregular topologies consider both the destination ID and the input channel. Therefore, these popular routing algorithms for irregular topologies may not be usable in InfiniBand networks because they do not conform to the IBA specifications. In this paper, we propose an easy-to-implement strategy to adapt the forwarding tables already computed following any routing algorithm that considers the destination ID and the input channel into the required IBA forwarding table format. The resulting routing algorithm is deadlock-free on IBA. Indeed, the originally computed paths are not modified at all. Hence, the proposed strategy does not degrade performance with respect to the original routing scheme.
منابع مشابه
Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks
The InfiniBand Architecture (IBA) defines a switchbased network with point-to-point links whose topology is arbitrarily established by the customer. Often, the interconnection pattern is irregular, which complicates routing and deadlock avoidance. Current routing algorithms for NOWs, either achieve a low network performance, such as the up*/down* routing scheme, or cannot be implemented on IBA ...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملDeadlock-free Routing in Irregular Networks Using Preex Routing
In this paper we propose a deadlock free routing in irregular networks using pre x routing Pre x routing is a special type of routing with a compact routing table associated with each node processor Basically each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node Node and channel labeling in an...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کاملImproving InfiniBand Routing through Multiple Virtual Networks
InfiniBand is very likely to become the de facto standard for communication between nodes and I/O devices (SANs) as well as for interprocessor communication (NOWs). The InfiniBand Architecture (IBA) defines a switchbased network with point-to-point links whose topology is arbitrarily established by the customer. Often, the interconnection pattern is irregular. Up*/down* is the most popular rout...
متن کامل